Tree based symmetric key broadcast encryption
نویسندگان
چکیده
منابع مشابه
Tree based symmetric key broadcast encryption
The most influential broadcast encryption (BE) scheme till date was introduced in 2001 by Naor, Naor and Lotspiech (NNL) and is based on binary trees. This paper generalizes the ideas of NNL to obtain BE schemes based on k-ary trees for any k ≥ 2. The treatment is uniform across all k and essentially provides a single scheme which is parameterized by the arity of the underlying tree. We perform...
متن کاملSymmetric-Key Broadcast Encryption: The Multi-sender Case
The problem of (stateless, symmetric-key) broadcast encryption, in which a central authority sends encrypted content that can be decrypted only by a designated subset of potential receivers, has been the focus of a significant amount of attention. Here, we consider a generalization of this problem in which all members of the group may act as both sender and receiver. The parameters of interest ...
متن کاملA key-policy attribute-based broadcast encryption
According to the broadcast encryption scheme with wide applications in the real world without considering its security and efficiency in the model simultaneously an “unbounded”, Key-Policy Attribute-Based Broadcast Encryption scheme(KP-ABBE) was proposed by combining with waters dual system encryption, attribute-based encryption and broadcast encryption system. Based on the standard model, the ...
متن کاملKey Generation of Attribute Based Broadcast Encryption
Broadcast Encryption (BE) scheme is allows the sender to securely distribute a data to a dynamically changing set of users over a unsecure channel. Attribute based Broadcast Encryption (ABBE) is a excellent approach for broadcasting. Existing BE classical BE approach required an explicitly specified decrypter list. In ABBE differentiate groups of users by their attribute. In ABBE encrypter enfo...
متن کاملBig-Key Symmetric Encryption: Resisting Key Exfiltration
This paper aims to move research in the bounded retrieval model (BRM) from theory to practice by considering symmetric (rather than public-key) encryption, giving efficient schemes, and providing security analyses with sharp, concrete bounds. The threat addressed is malware that aims to exfiltrate a user’s key. Our schemes aim to thwart this by using an enormously long key, yet paying for this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2015.05.010